digital communication nets and n-port resistive networks

a communication net is usually represented by a linear graph g whose branches represent channels for information flow and whose vertices represent sources, sinks and switching centers. the purpose of this paper is to show that for modeling digital communication nets, conventional use of the concepts of capacity and terminal capacity is inadequate . we will present an alternative to max-flow min-cut theorem for finding the maximum flow between a pair of vertices of g. it will be seen that this alternative procedure is equivalent to finding the admittance between a pair of terminals of a appropriately defined resistive network.